A Predict Deterministic Finite Automaton for Practical Deep Packet Inspection
نویسندگان
چکیده
منابع مشابه
A Memory-Efficient Deterministic Finite Automaton-Based Bit-Split String Matching Scheme Using Pattern Uniqueness in Deep Packet Inspection
This paper proposes a memory-efficient bit-split string matching scheme for deep packet inspection (DPI). When the number of target patterns becomes large, the memory requirements of the string matching engine become a critical issue. The proposed string matching scheme reduces the memory requirements using the uniqueness of the target patterns in the deterministic finite automaton (DFA)-based ...
متن کاملA platform-based SoC design and implementation of scalable automaton matching for deep packet inspection
String matching plays a central role in packet inspection applications such as intrusion detection, anti-virus, anti-spam and Web filtering. Since they are computation and memory intensive, software matching algorithms are insufficient to meet the high-speed performance. Thus, offloading packet inspection to a dedicated hardware seems inevitable. This paper presents a scalable automaton matchin...
متن کاملElastic Deep Packet Inspection
Deep packet inspection (DPI) systems are required to perform at or near network line-rate speeds, matching thousands of rules against the network traffi c. The engineering performance and price trade-offs are such that DPI is diffi cult to virtualize, either because of very high memory consumption or the use of custom hardware; similarly, a running DPI instance is diffi cult to ‘move’ cheaply t...
متن کاملBCK-ALGEBRAS AND HYPER BCK-ALGEBRAS INDUCED BY A DETERMINISTIC FINITE AUTOMATON
In this note first we define a BCK‐algebra on the states of a deterministic finite automaton. Then we show that it is a BCK‐algebra with condition (S) and also it is a positive implicative BCK‐algebra. Then we find some quotient BCK‐algebras of it. After that we introduce a hyper BCK‐algebra on the set of all equivalence classes of an equivalence relation on the states of a deterministic finite...
متن کاملOFA: A Scalable Finite Automata-based Pattern- Matching Engine for Out-of-Order Deep Packet Inspection
To match the signatures of malicious traffic across packet boundaries, network-intrusion detection (and prevention) systems (NIDS) typically perform pattern matching after flow reassembly or packet reordering. However, this may lead to the need for large packet buffers, making detection vulnerable to denial-of-service (DoS) attacks, whereby attackers exhaust the buffer capacity by sending long ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Engineering
سال: 2012
ISSN: 1877-7058
DOI: 10.1016/j.proeng.2012.01.279